Blockmodels with maximum concentration
نویسنده
چکیده
There are many circumstances in which binary relations are defined between pairs of objects: in sociology there are social relations between people; in business there are trading relations between firms; in design there are functional dependencies between components. In all of these the clustering of objects into densely interconnected blocks reveals something of the structure of the system. In this paper a criterion is presented which permits the construction of blocks to be formulated as a quadratic programme. The method is applied to two illustrative cases: the pattern of elective choices by MBA students and the performance assessment of British universities. The method is shown to give results which are readily interpreted and, for the purpose of performance ranking, leads to a more realistic description of achievement. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Variable selection for (realistic) stochastic blockmodels
Stochastic blockmodels provide a convenient representation of relations between communities of nodes in a network. However, they imply a notion of stochastic equivalence that is often unrealistic for real networks, and they comprise large number of parameters that can make them hardly interpretable. We discuss two extensions of stochastic blockmodels, and a recently proposed variable selection ...
متن کاملAsymptotic Normality of Maximum Likelihood and its Variational Approximation for Stochastic Blockmodels
Variational methods for parameter estimation are an active research area, potentially offering computationally tractable heuristics with theoretical performance bounds. We build on recent work that applies such methods to network data, and establish asymptotic normality rates for parameter estimates of stochastic blockmodel data, by either maximum likelihood or variational estimation. The resul...
متن کاملStochastic blockmodels with a growing number of classes.
We present asymptotic and finite-sample results on the use of stochastic blockmodels for the analysis of network data. We show that the fraction of misclassified network nodes converges in probability to zero under maximum likelihood fitting when the number of classes is allowed to grow as the root of the network size and the average network degree grows at least poly-logarithmically in this si...
متن کاملClustering via Content-Augmented Stochastic Blockmodels
Much of the data being created on the web contains interactions between users and items. Stochastic blockmodels, and other methods for community detection and clustering of bipartite graphs, can infer latent user communities and latent item clusters from this interaction data. These methods, however, typically ignore the items’ contents and the information they provide about item clusters, desp...
متن کاملBuilding stochastic blockmodels
The literature devoted to the construction of stochastic blockmodels is relatively rare compared to that of the deterministic variety. In this paper, a general definition of a stochastic blockmodel is given and a number of techniques for building such blockmodels are presented. In the statistical approach, the likelihood ratio statistic provides a natural index to evaluate the fit of the model ...
متن کاملNetwork Construction Methods for the Simulation of Stochastic Blockmodels DRAFT
This working paper summarizes a number of methods to construct networks represented as stochastic blockmodels. The different methods are developed to obtain networks that vary in relevant network measures, e.g., density, outdegrees, indegrees, degree variances.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 148 شماره
صفحات -
تاریخ انتشار 2003